Tableau Systems for SHIO and SHIQ
نویسندگان
چکیده
Two prominent families of algorithms for the satisfiability test of DLs are automatabased algorithms (see e.g. [6]), which translate a concept C into an automaton AC accepting all (abstractions of) models for C, and tableau algorithms (TAs) [2], which incrementally create a tree-shaped (pre-) model for C using a set of completion rules. In short, the advantages of automata algorithms are on the theoretical side, because in many cases the proofs are very elegant and provide tight complexity bounds (in particular for ExpTime-complete logics), whereas the advantages of tableau algorithms are on the practical side, since they are well suited for implementation and optimisation. Thus, an approach combining both advantages is highly desirable. In [1], we introduced tableau systems (TSs), a framework for tableau algorithms. From a TS for a DL L, we can derive an automata algorithm deciding satisfiability of L inputs in exponential time, and a tableau algorithm for L, including an appropriate blocking condition which ensures termination. As an application of this framework, we present in this paper tableau systems for two expressive DLs, the new DL SHIO and the wellknown SHIQ [5]. Our main results are the following: firstly, we obtain that SHIO satisfiability is ExpTime-complete and can be decided by a tableau algorithm. Secondly, we will see that although these two logics share most of their constructs, they lead to quite different TSs, which demonstrates how the capabilities of our framework can be used to capture different language properties. Thirdly, the succinctness of the proofs demonstrates how our framework simplifies the design of TAs.
منابع مشابه
Query Answering in the Description Logic Horn - SHIQ
We provide an ExpTime algorithm for answering conjunctive queries (CQs) in Horn-SHIQ, a Horn fragment of the well-known Description Logic SHIQ underlying the OWL-Lite standard. The algorithm employs a domino system for model representation, which is constructed via a worst-case optimal tableau algorithm for Horn-SHIQ; the queries are answered by reasoning over the domino system. Our algorithm n...
متن کاملExpTime Tableaux for the Description Logic SHIQ Based on Global State Caching and Integer Linear Feasibility Checking
We give the first ExpTime (complexity-optimal) tableau decision procedure for checking satisfiability of a knowledge base in the description logic SHIQ when numbers are coded in unary. Our procedure is based on global state caching and integer linear feasibility checking.
متن کاملCombining Ontologies with Correspondences and Link Relations: The E-SHIQ Representation Framework
Combining knowledge and beliefs of autonomous peers in distributed settings, is a major challenge. In this paper we consider peers that combine ontologies and reason jointly with their coupled knowledge. Ontologies are within the SHIQ fragment of Description Logics. Although there are several representation frameworks for modular Description Logics, each one makes crucial assumptions concerning...
متن کاملExtending Consequence-Based Reasoning to SHIQ
Description logics (DLs) [3] are a family of knowledge representation formalisms with numerous practical applications. SHIQ is a particularly important DL as it provides the formal underpinning for the Web Ontology Language (OWL). DLs model a domain of interest using concepts (i.e., unary predicate symbols) and roles (i.e., binary predicate symbols). DL applications often rely on subsumption—th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004